polyphase merge sort造句
例句與造句
- A tape-drive implementation of the polyphase merge sort was described in " The Art of Computer Programming ".
- The polyphase merge sort fixes this discrepancy by padding the actual distribution with imaginary " dummy runs " to simulate an ideal run distribution.
- This table roughly corresponds to the reduction factor per dataset moved tables shown in fig 3 and fig 4 of polyphase merge sort . pdf
- Consequently, the polyphase merge sort needs to be clever about the initial distribution of the input data's runs to the initial output files.
- In general, polyphase merge sort is better than ordinary merge sort when there are less than 8 files, while ordinary merge sort starts to become better at around 8 or more files.
- It's difficult to find polyphase merge sort in a sentence. 用polyphase merge sort造句挺難的
- For N less than 8 working files, a polyphase merge sort achieves a higher effective run count reduction factor by unevenly distributing sorted runs between N-1 working files ( explained in next section ).
- Using the run move count equation for the above examples : ordinary merge sort-> 16 x log2 ( 16 ) = 64, polyphase merge sort-> 17 x log2.73 ( 17 ) = 48.
- When the end of one of the N-1 working files is reached, then it becomes the new output file and what was the output file becomes one of the N-1 working input files, starting a new iteration of polyphase merge sort.
- A polyphase merge sort using 4 files will sort 17 single record runs in 4 iterations, but since each iteration but the last iteration only moves a fraction of the dataset, it only moves a total of 48 records in order to sort the dataset after the initial distribution.
- For a dataset consisting of 57 runs of 1 record each, then after the initial distribution, polyphase merge sort moves 232 records during the 6 iterations it takes to sort the dataset, for an overall reduction factor of 2.70 ( this is explained in more detail later ).